| blob | fd7af11ff8beb3ebd9743ca4f3a59e0b21c63899 |
1 \BOOKMARK [1][-]{section.1}{Plantilla}{}
2 \BOOKMARK [1][-]{section.2}{Teor\355a de n\372meros}{}
3 \BOOKMARK [2][-]{subsection.2.1}{Big mod}{section.2}
4 \BOOKMARK [2][-]{subsection.2.2}{Criba de Erat\363stenes}{section.2}
5 \BOOKMARK [2][-]{subsection.2.3}{Divisores de un n\372mero}{section.2}
6 \BOOKMARK [1][-]{section.3}{Combinatoria}{}
7 \BOOKMARK [2][-]{subsection.3.1}{Cuadro resumen}{section.3}
8 \BOOKMARK [2][-]{subsection.3.2}{Combinaciones, coeficientes binomiales, tri\341ngulo de Pascal}{section.3}
9 \BOOKMARK [2][-]{subsection.3.3}{Permutaciones con elementos indistinguibles}{section.3}
10 \BOOKMARK [2][-]{subsection.3.4}{Desordenes, desarreglos o permutaciones completas}{section.3}
11 \BOOKMARK [1][-]{section.4}{Grafos}{}
12 \BOOKMARK [2][-]{subsection.4.1}{Algoritmo de Dijkstra}{section.4}
13 \BOOKMARK [2][-]{subsection.4.2}{Minimum spanning tree: Algoritmo de Prim}{section.4}
14 \BOOKMARK [2][-]{subsection.4.3}{Minimum spanning tree: Algoritmo de Kruskal + Union-Find}{section.4}
15 \BOOKMARK [2][-]{subsection.4.4}{Algoritmo de Floyd-Warshall}{section.4}
16 \BOOKMARK [2][-]{subsection.4.5}{Algoritmo de Bellman-Ford}{section.4}
17 \BOOKMARK [2][-]{subsection.4.6}{Puntos de articulaci\363n}{section.4}
18 \BOOKMARK [2][-]{subsection.4.7}{M\341ximo flujo: M\351todo de Ford-Fulkerson, algoritmo de Edmonds-Karp}{section.4}
19 \BOOKMARK [2][-]{subsection.4.8}{M\341ximo flujo para grafos dispersos usando Ford-Fulkerson}{section.4}
20 \BOOKMARK [2][-]{subsection.4.9}{M\341ximo flujo para grafos disperos usando algoritmo de Dinic}{section.4}
21 \BOOKMARK [2][-]{subsection.4.10}{M\341ximo flujo m\355nimo costo}{section.4}
22 \BOOKMARK [2][-]{subsection.4.11}{Componentes fuertemente conexas: Algoritmo de Tarjan}{section.4}
23 \BOOKMARK [2][-]{subsection.4.12}{2-Satisfiability}{section.4}
24 \BOOKMARK [1][-]{section.5}{Programaci\363n din\341mica}{}
25 \BOOKMARK [2][-]{subsection.5.1}{Longest common subsequence}{section.5}
26 \BOOKMARK [2][-]{subsection.5.2}{Partici\363n de troncos}{section.5}
27 \BOOKMARK [1][-]{section.6}{Geometr\355a}{}
28 \BOOKMARK [2][-]{subsection.6.1}{\301rea de un pol\355gono}{section.6}
29 \BOOKMARK [2][-]{subsection.6.2}{Centro de masa de un pol\355gono}{section.6}
30 \BOOKMARK [2][-]{subsection.6.3}{Convex hull: Graham Scan}{section.6}
31 \BOOKMARK [2][-]{subsection.6.4}{Convex hull: Andrew's monotone chain}{section.6}
32 \BOOKMARK [2][-]{subsection.6.5}{M\355nima distancia entre un punto y un segmento}{section.6}
33 \BOOKMARK [2][-]{subsection.6.6}{M\355nima distancia entre un punto y una recta}{section.6}
34 \BOOKMARK [2][-]{subsection.6.7}{Determinar si un pol\355gono es convexo}{section.6}
35 \BOOKMARK [2][-]{subsection.6.8}{Determinar si un punto est\341 dentro de un pol\355gono convexo}{section.6}
36 \BOOKMARK [2][-]{subsection.6.9}{Determinar si un punto est\341 dentro de un pol\355gono cualquiera}{section.6}
37 \BOOKMARK [2][-]{subsection.6.10}{Intersecci\363n de dos rectas}{section.6}
38 \BOOKMARK [2][-]{subsection.6.11}{Intersecci\363n de dos segmentos de recta}{section.6}
39 \BOOKMARK [1][-]{section.7}{Estructuras de datos}{}
40 \BOOKMARK [2][-]{subsection.7.1}{\301rboles de Fenwick \363 Binary indexed trees}{section.7}
41 \BOOKMARK [2][-]{subsection.7.2}{Segment tree}{section.7}
42 \BOOKMARK [1][-]{section.8}{Miscel\341neo}{}
43 \BOOKMARK [2][-]{subsection.8.1}{El parser m\341s r\341pido del mundo}{section.8}
44 \BOOKMARK [2][-]{subsection.8.2}{Checklist para corregir un Wrong Answer}{section.8}
45 \BOOKMARK [1][-]{section.9}{Java}{}
46 \BOOKMARK [2][-]{subsection.9.1}{Entrada desde entrada est\341ndar}{section.9}
47 \BOOKMARK [2][-]{subsection.9.2}{Entrada desde archivo}{section.9}
48 \BOOKMARK [2][-]{subsection.9.3}{Mapas y sets}{section.9}
49 \BOOKMARK [2][-]{subsection.9.4}{Colas de prioridad}{section.9}
50 \BOOKMARK [1][-]{section.10}{C++}{}
51 \BOOKMARK [2][-]{subsection.10.1}{Entrada desde archivo}{section.10}
52 \BOOKMARK [2][-]{subsection.10.2}{Strings con caract\351res especiales}{section.10}